Spanning trees and even integer eigenvalues of graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge-disjoint spanning trees and eigenvalues of regular graphs

Partially answering a question of Paul Seymour, we obtain a sufficient eigenvalue condition for the existence of k edge-disjoint spanning trees in a regular graph, when k ∈ {2, 3}. More precisely, we show that if the second largest eigenvalue of a d-regular graph G is less than d − 2k−1 d+1 , then G contains at least k edge-disjoint spanning trees, when k ∈ {2, 3}. We construct examples of grap...

متن کامل

Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs

Let λ2(G) and τ (G) denote the second largest eigenvalue and the maximum number of edge-disjoint spanning trees of a graph G, respectively. Motivated by a question of Seymour on the relationship between eigenvalues of a graph G and bounds of τ (G), Cioabă and Wong conjectured that for any integers d , k ≥ 2 and a d -regular graph G, if λ2(G) < d − 2k−1 d+1 , then τ (G) ≥ k. They proved the conj...

متن کامل

Counting the number of spanning trees of graphs

A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.

متن کامل

NUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS

In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2014

ISSN: 0012-365X

DOI: 10.1016/j.disc.2014.01.023